Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations
نویسندگان
چکیده
We present a method to decompose an arbitrary 3D piecewise linear complex (PLC) into a constrained Delaunay tetrahedralization (CDT). It successfully resolves the problem of non-existence of a CDT by updating the input PLC into another PLC which is topologically and geometrically equivalent to the original one and does have a CDT. Based on a strong CDT existence condition, the redefinition is done by a segment splitting and vertex perturbation. Once the CDT exists, a practically fast cavity retetrahedralization algorithm recovers the missing facets. This method has been implemented and tested through various examples. In practice, it behaves rather robust and efficient for relatively complicated 3D domains.
منابع مشابه
Collars and Intestines: Practical Conforming Delaunay Refinement
While several existing Delaunay refinement algorithms allow acute 3D piecewise linear complexes as input, algorithms producing conforming Delaunay tetrahedralizations (as opposed to constrained or weighted Delaunay tetrahedralizations) often involve cumbersome constructions and are rarely implemented. We describe a practical construction for both “collar” and “intestine”-based approaches to thi...
متن کاملOn The Robust Construction of Constrained Delaunay Tetrahedralizations
We present a simple and robust algorithm to construct the Constrained Delaunay Tetrahedralization(CDT) for a Piecewise Linear Complex(PLC). The algorithm is based on Si’s CDT [1] algorithm, but we provide a new facet recovery algorithm, which is simple and easy to implement. The implementation and robustness issues of the CDT algorithm are discussed in detail and the program which implements th...
متن کاملDelaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates
Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and nonmanifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these comp...
متن کاملProgressive Previewing of Ray-Traced Images Using Image-Plane Discontinuity Meshing
This paper presents a new method for progressively previewing a raytraced image while it is being computed. Our method constructs and incrementally updates a constrained Delaunay triangulation of the image plane. The points in the triangulation correspond to all of the image samples that have been computed by the ray tracer, and the constraint edges correspond to various important discontinuity...
متن کاملConstrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery
In two dimensions, a constrained Delaunay triangulation (CDT) respects a set of segments that constrain the edges of the triangulation, while still maintaining most of the favorable properties of ordinary Delaunay triangulations (such as maximizing the minimum angle). CDTs solve the problem of enforcing boundary conformity—ensuring that triangulation edges cover the boundaries (both interior an...
متن کامل